File compression using sequence splits and sequence alignment

ABSTRACT

Compressing files is disclosed. An input file to be compressed is first aligned. Aligning the file includes splitting the file into sequences that can be aligned. When splitting the file into sequences or when performing subsequent recursive splitting, the splitting is based on a longest sequence match. The result is a compression matrix, where each row of the matrix corresponds to part of the file. A consensus sequence is determined from the compression matrix. Using the consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The compressed file includes the pointer pairs and the consensus sequence.

FIELD OF THE INVENTION

Embodiments of the present invention generally relate to compression. More particularly, at least some embodiments of the invention relate to systems, hardware, software, computer-readable media, and methods for compressing data using multiple sequence alignment.

BACKGROUND

Data compression is a technology that provides numerous benefits. Compression reduces the size of the data by a compression ratio. By reducing the size of data, less storage space is required to store the data and less bandwidth is required to transmit compressed data.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which at least some of the advantages and features of the invention may be obtained, a more particular description of embodiments of the invention will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered to be limiting of its scope, embodiments of the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings, in which:

FIG. 1 discloses aspects of a compression engine configured to compress data;

FIG. 2 discloses aspects of a compression engine configured to compress data using multiple sequence alignment;

FIG. 3A discloses aspects of compressing data that include long zero sequences;

FIG. 3B discloses aspects of splitting sequences during alignment operations;

FIG. 4 discloses aspects of pointer pairs;

FIG. 5 discloses aspects of warming up operations to reduce computation times in compression operations;

FIG. 6 discloses aspects of hierarchical compression;

FIG. 7 discloses aspects of performing compression in a computing environment; and

FIG. 8 discloses aspect of a computing device or a computing environment.

DETAILED DESCRIPTION OF SOME EXAMPLE EMBODIMENTS

Embodiments of the present invention generally relate to compression and compression operations using data alignment. More particularly, at least some embodiments of the invention relate to systems, hardware, software, computer-readable media, and methods for compressing data and further relate to compressing data using sequence alignment.

Embodiments of the invention provide a compression engine that is configured to compress data using an alignment mechanism. The compression engine receives a file as input and performs a splitting operation to generate a matrix of sequences. The file is split into multiple sequences. Each sequence corresponds to part of the file being compressed. When the matrix is generated, gaps may be included or inserted into some of the sequences for alignment purposes. Once the matrix is completed, a consensus sequence is identified or derived from the compression matrix. The original file is compressed by representing the input file as a list of pointer pairs into the consensus sequence. Each pointer pair corresponds to a part of the file and each pointer pair identifies the beginning and end of a subsequence in the consensus sequence. The file can be reconstructed by concatenating the subsequences in the consensus sequence identified by the pointer pairs. As used herein, a consensus may refer to at least a compression matrix and/or a consensus sequence.

Embodiments of the invention are discussed with reference to a file by way of example and not limitation. The compression operations discussed herein may be applied to any data or data type. Further, embodiment of the invention may be applied to large files such as disk/volume images or the like.

When compressing a file, one object of alignment is to divide the file into multiple pieces that are similar. The goal of alignment is to identify sequences that are similar. For example, the similarity of sequences can be scored. In a situation where n bits of a file are represented by a letter, a sequence of ABABAB may be similar to a sequence of ABAAAC. A similarity score may reflect, for example, how many of the letters match. In one example, similar sequences can be made to be identical by inserting gaps into the sequences. Identical, in this context, means that the columns of the sequences, when arranged in a matrix, have the same letters (or a gap).

More specifically, in order to achieve the alignment, it may be necessary to adjust some of the sequences such that each piece of the file includes data represented in a manner that allows the pieces or sequences to be aligned. For example, assume a file is represented by AAAAAAB. Also assume that the file is split into two pieces (or sequences): AAA and AAB. In order to align these sequences, it is necessary to insert a space or a gap. This may result in the following sequences (a space or gap is represented by “-”): AAA- and AA-B. When these sequences are aligned in a matrix, each column contains the same letter and/or gaps. This allows the file to be compressed as more fully described below.

The alignment process results in multiple sequences that can be arranged in a matrix in one example. Because a file may be large, the alignment process may involve an iterative process of splitting and aligning. This is performed until the length of the sequences is sufficient or when a consensus length has been reached.

By way of example, the alignment process maintains a list of pieces that can be split. These pieces may have the same length in one example. For each round or iteration, a piece is selected from that split. In an embodiment, a piece with the highest length is split, and aligned. If the consensus length is smaller by a determined threshold than the previous consensus length, new pieces or sequences resulting from the split are added back to the list of pieces that can be split. This process continues until resources are exhausted, the length of the consensus is sufficient (e.g., meets a threshold length), or the list of splitable pieces is empty. This process may also include adding spaces or gaps as appropriate. In one example, gaps are added in each alignment. When completed, a compression matrix is generated as discussed below.

FIG. 1 discloses aspects of compressing data with a compression engine. FIG. 1 illustrates a compression engine 100. The compression engine 100 may be implemented at the edge, at the near edge, or in the cloud and may include physical machines (e.g., servers), virtual machines, containers, processors, memory, other computing hardware, or the like or combination thereof. The compression engine 100 may cooperate with or be integrated with a system or application such as a data protection system. For example, data backups, volumes, disk/volume images, or the like may be compressed prior to transmission over a network, prior to storage, for archiving, or the like. In some examples, compression operations are examples of data protection operations.

The compression engine 100 is configured to receive a file 102 as input. The compression engine 100 outputs a compressed file 110. More specifically, the file 102 is received at an alignment engine 104 that is configured to generate a compression matrix 106. In one example, the alignment engine 104 may perform a greedy splitting algorithm on the file 102 to generate the matrix. The splitting algorithm, in effect, divides the bits of the file 102 into multiple sequences of the same length. After each split, the alignment of the pieces is evaluated. If not sufficiently aligned, one or more of the pieces may be split again. This process may continue until the remaining pieces of sequences are sufficiently aligned. Once aligned, the resulting sequences constitute the compression matrix 106 and each sequence may correspond to a row of the matrix 106. If necessary, gaps are inserted into some of the sequences such that the matrix 106 is aligned. Gaps may be inserted during the alignment process.

More specifically, the matrix 106 may be represented a structure that includes rows and columns. The alignment engine 104 may be configured to determine the number of columns and/or rows during the splitting or alignment operation. During alignment, the file 102 is split until the rows of the matrix 106 can be generated. The alignment performed by the alignment engine 104 ensures that, for a given column in the matrix 106, the entries are all the same, except that some of the entries in a given column may be gaps. As previously stated, during alignment, gaps may be inserted at various locations of the sequences such that each column contains the same information in each row or a gap.

A consensus sequence is identified from the matrix 106 or derived from the matrix 106 and used by the file generator 108 to generate the compressed file 110. The entire file 102 is represented in the consensus sequence. Because each of the rows correspond to a part of the file and each has information that is present in the consensus matrix, the bits in the file can be represented using pointers into the consensus sequence. The compressed file 110 may include the consensus sequence and the pointer pairs. Each row of the compression matrix may be represented by one or more pointers. Gaps in a given row are not represented by pointers. Once the compressed file 110 is generated, the compression matrix 106 may be discarded.

FIG. 2 discloses aspects of compressing a file. In FIG. 2 , a file 202 is illustrated or represented as a series of letters: ABAADCCCABACADCCABCAD. Each of these letters may represent n bits of the file 202. Because n may vary or change from one compression operation to the next compression operation, the compression ratio may also change. In one example, n may be specified as an input parameter to the alignment engine 204 or may be determined by the sequencing or aligning performed by the alignment engine 204. The size of n may impact computation time.

The file 202 is aligned (or sequenced) by the alignment engine 204 to generate a compression matrix 206. The compression matrix includes rows and columns. Each column, such as the columns 210 and 210, contain either the same letter and/or a gap, which gap is represented as a “-” in FIG. 2 . During sequencing or alignment performed by the alignment engine 204, the file 202 may be split into pieces until the matrix 206 is generated. When the alignment engine 204 completes its work and the pieces of the input file 202 are aligned, each of the columns in the matrix 206 contains the same letter and/or a gap. Thus, each row of the matrix 206 of the column 212 include the letter “C” and a gap while the column 210 contains the letter “A” with no gaps. No mismatches (e.g., a column contains more than one letter) are allowed.

The alignment performed by the alignment engine 204 allows a consensus sequence 208 to be generated or determined. The consensus sequence 208 includes the letters of the corresponding columns from the matrix 206. In this example, the consensus sequence 208 is generated from the matrix 206. However, the matrix 206 may also include the consensus sequence 208.

In effect, the consensus sequence 208 is a vector v, where v[i] is the letter or letter type that exists in column i, disregarding gaps. The vector may be multi-dimensional when compressing multi-dimensional data.

The pseudocode performed by the alignment engine 204 is as follows:

input: file V, with each k bits represented as a single letter set splitcandidates ←{V} set nonSplit ←{ } while |splitCandidates| > 0:  baseCMSA ← CMSA(nonSplit U splitcandidates)  set splitCandidates_(new) ←{ }  set nonSplit_(new) ← nonSplit  for volumePiece in splitcandidates: //Can be done concurrently   L,R ← halve volumePiece   if len(CMSA(nonSplit ∪ splitCandidates\volumePiece ∪ L ∪ R)) < len(baseCMSA):    splitCandidates_(new) = splitCandidates_(new) ∪ L ∪ R   else:    nonSplit_(new)= nonSplit_(new) ∪ volumePiece  splitCandidates = splitCandidates_(new)  nonSplit = nonSplit_(new)

Once completed, the nonSplit sequences will be a matrix of letters and gaps, such as the matrix 206. The consensus sequence 208 is taken or derived from the matrix 206.

The file generator 214 uses the consensus matrix 208 to generate pointer pairs that represent the letter or bits in the file. In this example, the consensus matrix 208 is an array or vector with entries 0 . . . 8. When generating the pointer pairs, the matrix 206 may be processed row by row. In the first row, the first subsequence is ABA corresponds to locations 1, 2, and 3 of the consensus sequence 208. The first pointer in the list of pointer pairs 216 is thus P₁ (1:3).

Using the consensus matrix, the file 202 may be represented with the following pointer pairs 216, which each point into the consensus sequence 208 and correspond to a part of the file 202:

P₁—(1:3)—this corresponds to ABA (see row 224 of the matrix 206); P₂—(5:8)—this corresponds to ADCC (see row 224 of the matrix 206); P₃—(0:7)—this corresponds to CABACADC (see row 226 of the matrix 206); P₄—(0:2)—this corresponds to CAB (see row 228 of the matrix 206); and P₅—(4:6)—this corresponds to CAD (see row 228 of the matrix 206).

The compressed file 218 includes P₁ . . . P₅ and the consensus sequence 208. This information allows the file to be decompressed into the file 202. More specifically, the file 202 is reconstructed by replacing each pointer in the list of pointers with the subsequence (letters or bits corresponding to the letters) of the consensus sequence 208 to which the pointers point. This process does not require the gaps to be considered as the pointer pairs 216 do not reference gaps but only reference the consensus sequence 208.

In one example and if desired, the compressed file 218 may be compressed with another compressor 220 (e.g., Hoffman Coding) to generate a compressed file 222, which has been compressed twice in this example. This allows the consensus sequence 208, which may be long, and/or the pointer pairs 216 to be compressed by the compressor 220 for additional space savings.

In one example, long 0 sequences (sequences of 0 bits) are not represented with a letter. Rather, long 0 sequences may be represented as a 0 sequence and a length. FIG. 3A discloses aspects of handling long 0 sequences in a file. FIG. 3A illustrates a file 302, which is similar to the file 202 but includes a zero sequence 304. In this example, sequencing the file 302 may result in the same matrix 206 as the zero sequence 304 may be omitted or handled differently. Thus, the pointer pairs for the file 304 are the same as discussed in FIG. 2 .

In this example, the zero sequence 304 and its length are identified as a pair 306 and inserted into the pointer pairs 308 at the appropriate place (after P₂ and before P₃). The pair 306 represents a zero-sequence having a length of 17 bits—(0:17). One sequences (a sequence of 1s) could be handled in a similar manner if present.

In one example, the actual data from the consensus sequence may be used in the pointer pairs instead of a pointer pair. More specifically, if the letters in the consensus sequence represent a small number of bits, it may conserve storage space to simply include the subsequence as present in the consensus matrix because the subsequence may take less space than the pointers (each pointer includes multiple bits).

FIG. 3B discloses aspects of a compression operation including splitting sequences. As previously discussed, the alignment operation as a whole may involve multiple splitting operations or recursions. FIG. 3B illustrates aspects of a splitting operation or of a recursion. In this example, a sequence pool 230 includes pieces or splits of an original file. The pieces are represented by sequences 232, 234, and 236. The pool 230 of sequences represents pieces or sequences that are potentially subject to additional splitting.

In this example, the sequence 234 is selected and a splitting operation is performed. FIG. 3B illustrates at least two different types of splitting operations—split 242 and split 244. These splits 242 and 244 assume that the sequence 234 is represented by or includes letters ASDFSASDFFASDFSWSDFFASDFS.

The split 244 may be an example of greedy splitting. Generally, greedy splitting chooses a split based on an apparent benefit or a predefined selection (e.g., in half). In the context of splitting a sequence, the split 244 may simply perform the split that may seem the most beneficial without a holistic view of the overall alignment operation. In this example, the split 244 may simply divide the sequence into two pieces and then proceed with the next steps of the alignment operation.

The split 242 is distinct from a greedy split and does not blindly split the sequence 234. In this example, the sequence 234 is evaluated to find the longest sequence match. The sequence 234 includes three instances of “ASDFS”. The split is performed before and after the longest sequence and recurred as previously described. This may result in sequences 246. The sequences 246 are then aligned as aligned sequences 248 by inserting gaps where appropriate. If this were the last split, it may result in a consensus sequence 250. In this case, the aligned sequences 248 constitute the compression matrix along with sequences derived from the other sequences in the pool 230.

FIG. 3B illustrates that the process of generating the compression matrix, which may include multiple instances of splitting and aligning, may split based on a longest sequence match in the sequence being split.

In one example, splitting is performed until a consensus length is determined for the sequences. The consensus sequence length can be determined in different ways. In one example, the recursive alignment operation may stop when splits fail to reduce the consensus sequence length. In another example, a minimum threshold may be determined and recursion is stopped when the minimum threshold level is achieved.

In one example, there is a level at which further aligning provides no benefit. More specifically, the relationships between the pointer, the length representation, the consensus size, and symbol or letter sizes can impact or determine when the alignment operation stops. For example, if the letters are 2 byte Unicode characters, the pointer is 8 bytes, and the length is 2 bytes, there is no need to represent matches that have less than 5 characters. Using the match is longer than using the actual characters. More specifically, the pointer and the length of the subsequence uses 10 bytes in this example. The size of 5 characters is 10 bytes. The minimum consensus length should ensure that using the matches (pointers and length) provides a benefit compared to using the actual characters in the matrix.

A compression operation that performs splitting using a longest based sequence split and a threshold level at which the aligning operations stops can improve compression performance because there is a potential for longer sequences and less computation time. More specifically, selecting the longest sequence may result in a longer minimum consensus length. Using a threshold level to stop the alignment operation can reduce the computation time (by stopping earlier than otherwise indicated by the alignment operation).

In another example, a splitting operation may choose to perform splits based on a fixed consensus. For example, when adding new content to a file, the consensus associated with the earlier version of the file may be fixed and may be used for splitting the new content such that the new content and the earlier version of the file can be compressed together.

FIG. 4 discloses additional aspects of compressing data. FIG. 4 illustrates a consensus sequence 416, which includes various entries that may be represented as a vector. FIG. 4 illustrates a pointer pair 416, which includes pointer 402 and pointer 404. The pointer for points to entry 412 and the pointer 404 points to entry 414. The pointer pair 418 thus represents a portion of a file that has been compressed using a consensus sequence 416. The pointer pair 418 identifies a subsequence of the consensus sequence 416.

FIG. 4 also illustrates a pointer pair 406 that includes a pointer 406 and an offset 408. Using a pointer pair 406 may be useful and may conserve space by eliminating the need to store a second pointer (the offset may consume less space than a pointer). Thus, the pointer pair 420 identifies a starting entry 410 and an offset 408, which is the length of the subsequence identified by the pointer pair. Thus, the offset 408 may require less space than the pointer 404.

The length represented by the offset 408 may also be represented using a variable length quantity (VLQ) to conserve or manage storage requirements. For example, the length of the sequence represented by the offset 408 is less than 127, a single byte may be used. The most significant bit is used to identify whether other bytes are used to represent the length of the sequence. If the length is longer than 127, two bytes may be used as the offset.

FIG. 5 discloses aspects of warm starting a compression operation. The warm start, for example, may be used in alignments performed by the alignment operation (e.g., a greedy splitting operation). FIG. 5 illustrates a matrix 502, which is the same as the matrix 206. When the letter size is large (e.g., each letter represents 128 bits), the computation time to generate the matrix 502 and compress the input file may be faster compared to when the letter size is smaller. In this example, the matrix 502 resulted from processing a file.

Next, the letter sizes may be halved, thus the new letters 506 are generated as A=ef, B=eg, C=fe, and D=he. This may result in the matrix 504. More specifically, the matrix 502 (or the associated alignment) may be generated as larger letter sizes is associated with quicker computation times. Thus, the matrix 502 may be used as a prior for a subsequent alignment operation with iteratively reduced (e.g., halved) letter sizes. Thus, the matrix 502 (or alignment information generated by the alignment engine) is used as a starting point for generating the matrix 504.

Embodiments of the invention may also perform processing prior to aligning the file. For example, a size of a file may be large (e.g., terabytes). Compressing such a file may require significant amounts of RAM. As the letter size decreases or due to the size of the file or for other reasons, the available RAM may be insufficient. Embodiments of the invention may compress the file using hierarchical alignments.

FIG. 6 discloses aspects of hierarchical alignment. FIG. 6 illustrates a file 602 that may be large (e.g., terabytes). To accommodate existing resources, the file 602 may divided into one or more portions, illustrated as portions 604, 606, 608. These portions are then compressed (sequentially, concurrently, or using different compression engines) by the compression engine 610 to generate, respectively, compressed files 612, 614, and 616. A compressor 618, which may be difference from the compression engine 610 and use other compressors, may be used to compress the compressed files 612, 614, and 616 into a single compressed file 620. Thus, compresses files including a consensus sequence and pointer pairs are generated for each of the portions 604, 606, and 608 and these compressed files are either compressed or concatenated into the compressed file 620.

FIG. 7 discloses aspects of a method for compressing data. Initially, an input file is received 702 in the method 700 at a compression engine. The input file is then aligned 704 or sequenced by an alignment engine to generate a compression matrix. Aligning a file may include splitting the file one or more times and/or adding gaps as necessary in order to generate a plurality of sequences that are aligned. The sequences are aligned, for example, when the sequences generated by splitting the file can be arranged in a matrix such that each column includes a single letter and/or gaps.

Next, the consensus sequence is determined 706. This may be performed by flattening the matrix or by selecting, for each entry in the consensus sequence, the letter in the corresponding column of the compression matrix.

Once the consensus sequence is determined, the file is compressed 710. This may include generating pointer pairs that point to the consensus sequence. Each pointer corresponds to a portion of the file. The file can be decompressed or reconstructed by concatenating the portions of the consensus sequence (or bits corresponding to the letters in the consensus sequence) correspond to the pointer pairs.

The computational requirements to compress files as discussed herein can be reduced, at the cost of compression efficiency. Examples of hyperparameters or parameters to consider include letter size (number of bits), number of initial splits of a file, minimal consensus length reduction required by the alignment engine (e.g., splitting operation), the size of initial chunks, and the number of stages where consensus sequences are aligned to a larger consensus sequence. Additionally, the role of the file (e.g., data base Kubernetes cluster) and block size used by the operating systems.

Embodiments of the invention may be used for log storage. Many applications, including data science applications, generate or require log data. However, logs are often retained for a short period of time due to their size and the difficulty of storing many logs. In one example, these logs can be compressed as discussed herein to conserve storage space. Each log may be treated as a file. For logs with similar fields, the fields can be pre-aligned to provide a warm start. Further hierarchical alignments based on log characteristics can be considered. For example, first level logs generated by the same action may be aligned.

Compression as discussed herein can be applied to JSON (JavaScript Object Notation) like document storage and structured storages (e.g., SQL (Structured Query Language) Databases).

Embodiments of the invention may be used to compress text files. In this example, a text file is like a string and can be aligned with a letter size of a single letter. Real text files often contain patterns that can be aligned.

Image files may have a two-dimensional structure. Embodiments of the invention can be extended to two dimensions. In this case, each row of the matrix may have two dimensions and gaps may be present in each dimension. The alignment engine can operate in both axes. The pointer pairs thus point to corresponding polygons in the consensus image, which is a multi-dimensioned consensus matrix. Embodiments of the invention can be extended to additional dimensions. In this case, the pointer pairs are now pointer lists to corresponding polygon meshes.

In bioinformatics, multiple sequence alignment (MSA) refers to a process or the result of sequence alignment of several biological sequences such as protein, DNA (deoxyribonucleic Acid), or RNA (ribonucleic acid). The input set of query sequences are assumed to have an evolutionary relationship. While the goal of MSA is to align the sequences, the output, in contrast to embodiments of the invention, may include multiple types of interactions including gaps, matches, and mismatches.

Appendix A includes an example of a Bacterial Foraging Optimization—Genetic Algorithm (BFO-GA) pseudocode and an example of an output of the BFO-GA algorithm. The BFO-GA, however, is not configured for compressing data, while embodiments of the invention relate to compressing data. Unlike BFO-GA and other MSA algorithms, the compression engine does not allow for mismatches and provides a positive score for subsequence matches above a certain length. Subsequence matches above a certain length facilitate the use of pointers during compression instead of the sequence itself.

The following is a discussion of aspects of example operating environments for various embodiments of the invention. This discussion is not intended to limit the scope of the invention, or the applicability of the embodiments, in any way.

In general, embodiments of the invention may be implemented in connection with systems, software, and components, that individually and/or collectively implement, and/or cause the implementation of, compression operations and/or data protection operations. Data protection operations which may include, but are not limited to, data replication operations, IO replication operations, data read/write/delete operations, data deduplication operations, data backup operations, data restore operations, data cloning operations, data archiving operations, and disaster recovery operations. More generally, the scope of the invention embraces any operating environment in which the disclosed concepts may be useful.

At least some embodiments of the invention provide for the implementation of the disclosed functionality in existing backup platforms, examples of which include the Dell-EMC NetWorker and Avamar platforms and associated backup software, and storage environments such as the Dell-EMC DataDomain storage environment. In general, however, the scope of the invention is not limited to any particular data backup platform or data storage environment.

New and/or modified data collected and/or generated in connection with some embodiments, may be stored in a data protection environment that may take the form of a public or private cloud storage environment, an on-premises storage environment, and hybrid storage environments that include public and private elements. Any of these example storage environments, may be partly, or completely, virtualized. The storage environment may comprise, or consist of, a datacenter which is operable to service read, write, delete, backup, restore, and/or cloning, operations initiated by one or more clients or other elements of the operating environment. Where a backup comprises groups of data with different respective characteristics, that data may be allocated, and stored, to different respective targets in the storage environment, where the targets each correspond to a data group having one or more particular characteristics.

Example cloud computing environments, which may or may not be public, include storage environments that may provide data protection functionality for one or more clients. Another example of a cloud computing environment is one in which processing, data protection, and other, services may be performed on behalf of one or more clients. Some example cloud computing environments in connection with which embodiments of the invention may be employed include, but are not limited to, Microsoft Azure, Amazon AWS, Dell EMC Cloud Storage Services, and Google Cloud. More generally however, the scope of the invention is not limited to employment of any particular type or implementation of cloud computing environment.

In addition to the cloud environment, the operating environment may also include one or more clients that are capable of collecting, modifying, and creating, data. As such, a particular client may employ, or otherwise be associated with, one or more instances of each of one or more applications that perform such operations with respect to data. Such clients may comprise physical machines, virtual machines (VM), or containers.

Particularly, devices in the operating environment may take the form of software, physical machines, VMs, containers, or any combination of these, though no particular device implementation or configuration is required for any embodiment. Similarly, data protection system components such as databases, storage servers, storage volumes (LUNs), storage disks, replication services, backup servers, restore servers, backup clients, and restore clients, for example, may likewise take the form of software, physical machines, virtual machines (VM), or containers, though no particular component implementation is required for any embodiment.

As used herein, the terms ‘data’ and ‘file’ are intended to be broad in scope. Thus, these terms embrace, by way of example and not limitation, data segments such as may be produced by data stream segmentation processes, data chunks, data blocks, atomic data, emails, objects of any type, files of any type including media files, word processing files, spreadsheet files, and database files, as well as contacts, directories, sub-directories, volumes, images, logs, databases, multi-dimensional data, and any group of one or more of the foregoing.

It is noted that any of the disclosed processes, operations, methods, and/or any portion of any of these, may be performed in response to, as a result of, and/or, based upon, the performance of any preceding process(es), methods, and/or, operations. Correspondingly, performance of one or more processes, for example, may be a predicate or trigger to subsequent performance of one or more additional processes, operations, and/or methods. Thus, for example, the various processes that may make up a method may be linked together or otherwise associated with each other by way of relations such as the examples just noted. Finally, and while it is not required, the individual processes that make up the various example methods disclosed herein are, in some embodiments, performed in the specific sequence recited in those examples. In other embodiments, the individual processes that make up a disclosed method may be performed in a sequence other than the specific sequence recited.

Following are some further example embodiments of the invention. These are presented only by way of example and are not intended to limit the scope of the invention in any way.

Embodiment 1. A method, comprising: receiving an input file into a compression engine, aligning the input file to create a compression matrix that includes sequences, wherein aligning the input file includes at least one iteration of splitting sequences associated with the input file, wherein splitting sequences includes selecting a longest sequence match in the sequence, determining a consensus sequence from the compression matrix, and generating a compressed file that include the consensus sequence and pointer pairs, wherein each pointer pair identifies a subsequence of the consensus sequence.

Embodiment 2. The method of embodiment 1, wherein aligning the input file includes splitting the input file a plurality of times, wherein a longest sequence match is selected at each iteration of splitting.

Embodiment 3. The method of embodiment 1 and/or 2, wherein aligning the input file includes stopping the aligning when a sequence length reaches a threshold length.

Embodiment 4. The method of embodiment 1, 2, and/or 3, wherein aligning the input file includes inserting gaps into at least some of the sequences.

Embodiment 5. The method of embodiment 1, 2, 3, and/or 4, wherein each pointer pair includes a first pointer and a second pointer that identify, respectively, starting and ending entries of a subsequence in the consensus sequence, wherein the consensus length is larger than the pointer pair.

Embodiment 6. The method of embodiment 1, 2, 3, 4, and/or 5, wherein each pointer pair includes a first pointer to entry in the consensus sequence and a length of a subsequence starting from the entry, wherein the consensus length is larger than the pointer pair.

Embodiment 7. The method of embodiment 1, 2, 3, 4, 5, and/or 6, further comprising splitting before the longest sequence in the sequence.

Embodiment 8. The method of embodiment 1, 2, 3, 4, 5, 6, and/or 7, further comprising splitting after the longest sequence in the sequence.

Embodiment 9. The method of embodiment 1, 2, 3, 4, 5, 6, 7, and/or 8, further comprising representing zero sequences in the pointer pairs, wherein the zero sequences are omitted from the compression matrix.

Embodiment 10. The method of embodiment 1, 2, 3, 4, 5, 6, 7, 8, and/or 9, wherein aligning the input file comprises performing a multiple sequence alignment that is configured to disallow mismatches and that allows gaps using the longest sequence match at each recursion.

Embodiment 11. A method for performing any of the operations, methods, or processes, or any portion of any of these, or any combination thereof, disclosed herein.

Embodiment 12. A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising the operations of any one or more of embodiments 1-11.

The embodiments disclosed herein may include the use of a special purpose or general-purpose computer including various computer hardware or software modules, as discussed in greater detail below. A computer may include a processor and computer storage media carrying instructions that, when executed by the processor and/or caused to be executed by the processor, perform any one or more of the methods disclosed herein, or any part(s) of any method disclosed.

As indicated above, embodiments within the scope of the present invention also include computer storage media, which are physical media for carrying or having computer-executable instructions or data structures stored thereon. Such computer storage media may be any available physical media that may be accessed by a general purpose or special purpose computer.

By way of example, and not limitation, such computer storage media may comprise hardware storage such as solid state disk/device (SSD), RAM, ROM, EEPROM, CD-ROM, flash memory, phase-change memory (“PCM”), or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other hardware storage devices which may be used to store program code in the form of computer-executable instructions or data structures, which may be accessed and executed by a general-purpose or special-purpose computer system to implement the disclosed functionality of the invention. Combinations of the above should also be included within the scope of computer storage media. Such media are also examples of non-transitory storage media, and non-transitory storage media also embraces cloud-based storage systems and structures, although the scope of the invention is not limited to these examples of non-transitory storage media.

Computer-executable instructions comprise, for example, instructions and data which, when executed, cause a general-purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. As such, some embodiments of the invention may be downloadable to one or more systems or devices, for example, from a website, mesh topology, or other source. As well, the scope of the invention embraces any hardware system or device that comprises an instance of an application that comprises the disclosed executable instructions.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts disclosed herein are disclosed as example forms of implementing the claims.

As used herein, the term ‘module’ or ‘component’ may refer to software objects or routines that execute on the computing system. The different components, modules, engines, and services described herein may be implemented as objects or processes that execute on the computing system, for example, as separate threads. While the system and methods described herein may be implemented in software, implementations in hardware or a combination of software and hardware are also possible and contemplated. In the present disclosure, a ‘computing entity’ may be any computing system as previously defined herein, or any module or combination of modules running on a computing system.

In at least some instances, a hardware processor is provided that is operable to carry out executable instructions for performing a method or process, such as the methods and processes disclosed herein. The hardware processor may or may not comprise an element of other hardware, such as the computing devices and systems disclosed herein.

In terms of computing environments, embodiments of the invention may be performed in client-server environments, whether network or local environments, or in any other suitable environment. Suitable operating environments for at least some embodiments of the invention include cloud computing environments where one or more of a client, server, or other machine may reside and operate in a cloud environment.

With reference briefly now to FIG. 8 , any one or more of the entities disclosed, or implied, by Figures and/or elsewhere herein, may take the form of, or include, or be implemented on, or hosted by, a physical computing device, one example of which is denoted at 800. As well, where any of the aforementioned elements comprise or consist of a virtual machine (VM), that VM may constitute a virtualization of any combination of the physical components disclosed in FIG. 8 .

In the example of FIG. 8 , the physical computing device 800 includes a memory 802 which may include one, some, or all, of random-access memory (RAM), non-volatile memory (NVM) 804 such as NVRAM for example, read-only memory (ROM), and persistent memory, one or more hardware processors 806, non-transitory storage media 808, UI device 810, and data storage 812. One or more of the memory components 802 of the physical computing device 800 may take the form of solid-state device (SSD) storage. As well, one or more applications 814 may be provided that comprise instructions executable by one or more hardware processors 806 to perform any of the operations, or portions thereof, disclosed herein.

Such executable instructions may take various forms including, for example, instructions executable to perform any method or portion thereof disclosed herein, and/or executable by/at any of a storage site, whether on-premises at an enterprise, or a cloud computing site, client, datacenter, data protection site including a cloud storage site, or backup server, to perform any of the functions disclosed herein. As well, such instructions may be executable to perform any of the other operations and methods, and any portions thereof, disclosed herein.

The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope. 

What is claimed is:
 1. A method, comprising: receiving an input file into a compression engine; aligning the input file to create a compression matrix that includes sequences, wherein aligning the input file includes at least one iteration of splitting sequences associated with the input file, wherein splitting sequences includes selecting a longest sequence match in the sequence; determining a consensus sequence from the compression matrix; and generating a compressed file that include the consensus sequence and pointer pairs, wherein each pointer pair identifies a subsequence of the consensus sequence.
 2. The method of claim 1, wherein aligning the input file includes splitting the input file a plurality of times, wherein a longest sequence match is selected at each iteration of splitting.
 3. The method of claim 1, wherein aligning the input file includes stopping the aligning when a sequence length reaches a threshold length.
 4. The method of claim 1, wherein aligning the input file includes inserting gaps into at least some of the sequences.
 5. The method of claim 1, wherein each pointer pair includes a first pointer and a second pointer that identify, respectively, starting and ending entries of a subsequence in the consensus sequence, wherein the consensus length is larger than the pointer pair.
 6. The method of claim 1, wherein each pointer pair includes a first pointer to entry in the consensus sequence and a length of a subsequence starting from the entry, wherein the consensus length is larger than the pointer pair.
 7. The method of claim 1, further comprising splitting before the longest sequence in the sequence.
 8. The method of claim 7, further comprising splitting after the longest sequence in the sequence.
 9. The method of claim 1, further comprising representing zero sequences in the pointer pairs, wherein the zero sequences are omitted from the compression matrix.
 10. The method of claim 1, wherein aligning the input file comprises performing a multiple sequence alignment that is configured to disallow mismatches and that allows gaps using the longest sequence match at each recursion.
 11. A non-transitory storage medium having stored therein instructions that are executable by one or more hardware processors to perform operations comprising: receiving an input file into a compression engine; aligning the input file to create a compression matrix that includes sequences, wherein aligning the input file includes at least one iteration of splitting sequences associated with the input file, wherein splitting sequences includes selecting a longest sequence match in the sequence; determining a consensus sequence from the compression matrix; and generating a compressed file that include the consensus sequence and pointer pairs, wherein each pointer pair identifies a subsequence of the consensus sequence.
 12. The non-transitory storage medium of claim 11, wherein aligning the input file includes splitting the input file a plurality of times, wherein a longest sequence match is selected at each iteration of splitting.
 13. The non-transitory storage medium of claim 11, wherein aligning the input file includes stopping the aligning when a sequence length reaches a threshold length.
 14. The non-transitory storage medium of claim 11, wherein aligning the input file includes inserting gaps into at least some of the sequences.
 15. The non-transitory storage medium of claim 11, wherein each pointer pair includes a first pointer and a second pointer that identify, respectively, starting and ending entries of a subsequence in the consensus sequence, wherein the consensus length is larger than the pointer pair.
 16. The non-transitory storage medium of claim 11, wherein each pointer pair includes a first pointer to entry in the consensus sequence and a length of a subsequence starting from the entry, wherein the consensus length is larger than the pointer pair.
 17. The non-transitory storage medium of claim 11, further comprising splitting before the longest sequence in the sequence.
 18. The non-transitory storage medium of claim 17, further comprising splitting after the longest sequence in the sequence.
 19. The non-transitory storage medium of claim 11, further comprising representing zero sequences in the pointer pairs, wherein the zero sequences are omitted from the compression matrix.
 20. The non-transitory storage medium of claim 11, wherein aligning the input file comprises performing a multiple sequence alignment that is configured to disallow mismatches and that allows gaps using the longest sequence match at each recursion. 